Some Inequalities for Nilpotent Multipliers of Powerful p-Groups

Authors

  • B. Mashayekhy
  • F. Mohammadzadeh
Abstract:

This article doesn't have abstract

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Isoperimetric inequalities for nilpotent groups

We prove that every finitely generated nilpotent group of class c admits a polynomial isoperimetric function of degree c+1 and a linear upper bound on its filling length function. 1991 Mathematics Subject Classification: 20F05, 20F32, 57M07

full text

Filling Inequalities for Nilpotent Groups

We give methods for bounding the higher-order filling functions of a homogeneous nilpotent group and apply them to a family of quadratically presented groups constructed by S. Chen[9]. We find sharp bounds on some higher-order filling invariants of these groups. In particular, we show that groups with arbitrarily large nilpotency class can have euclidean n-dimensional filling volume and give an...

full text

Ü Bounds for Spectral Multipliers on Nilpotent Groups

A criterion is given for the Lp boundedness of a class of spectral multiplier operators associated to left-invariant, homogeneous subelliptic second-order differential operators on nilpotent Lie groups, generalizing a theorem of Hörmander for radial Fourier multipliers on Euclidean space. The order of differentiability required is half the homogeneous dimension of the group, improving previous ...

full text

NILPOTENT p-LOCAL FINITE GROUPS

In this paper we provide characterizations of p-nilpotency for fusion systems and p-local finite groups that are inspired by known result for finite groups. In particular, we generalize criteria by Atiyah, Brunetti, Frobenius, Quillen, Stammbach and Tate.

full text

Some Algorithms for Nilpotent Permutation Groups

(Received) Let G, H and E be subgroups of a nite nilpotent permutation group of degree n. We describe the theory and implementation of an algorithm to compute the normalizer N G (H) in time polynomial in n, and we give a modiied algorithm to determine whether H and E are conjugate under G and, if so, to nd a conjugating element of G. Other algorithms produce the intersection G \ H and the centr...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 33  issue No. 2

pages  61- 71

publication date 2011-01-20

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023